Dynamic Hierarchical Search on the GPU
نویسندگان
چکیده
Figure 1: Plans computed for several agents and goals on challenging benchmarks.
منابع مشابه
GPU Octrees and Optimized Search
Octree structures are widely used in graphic applications to accelerate the computation of geometric proximity relations. This data strucutre is fundamental for game engine architectures for a correct scene management and culling process. With the increasing power of graphics hardware, processing tasks are progressively ported of to those architectures. However, octrees are essentially hierarch...
متن کاملHierarchical Bucket Queuing for Fine-Grained Priority Scheduling on the GPU
While the modern graphics processing unit (GPU) offers massive parallel compute power, the ability to influence the scheduling of these immense resources is severely limited. Therefore, the GPU is widely considered to be only suitable as an externally controlled co-processor for homogeneous workloads which greatly restricts the potential applications of GPU computing. To address this issue, we ...
متن کاملGPU-based Parallel Hybrid Genetic Algorithms
Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of algorithms such as genetic algorithms (GAs) and local search (LS) methods have provided very powerful search algorithms. However, due to their complexity, the computational time of the solution search exploration remains exorbitant when large problem instances are to be so...
متن کاملShell: Accelerating Ray Tracing on GPU
Ray tracing is a fundamental process in many areas including computer graphics and medical applications. Different hierarchical acceleration structures for ray tracing have been developed. Such ray tracing approaches executed on advanced many-core processors such as GPU, however, turns out to be memory bounded due to their frequent search operations in the hierarchical structures. This paper pr...
متن کاملInteractive Dynamic Volume Trees on the GPU
In many systems hierarchical data structures are used to accelerate the access to spatial data, whereas other applications use a hierarchical volumetric data structure to implicitly represent 3D objects. We introduce Dynamic Volume Trees (DVT), i.e. an adaptive hierarchical volume data structure which can be modified in real-time. The online capability is achieved by realizing both the hierarch...
متن کامل